Finding Minimum Congestion Spanning Trees
نویسنده
چکیده
Given a graph G and a positive integer k, we want to nd k spanning trees on G, not necessarily disjoint, of minimum total weight, such that the weight of each edge is subject to a penalty function if it belongs to more than one tree. We present a polynomial time algorithm for this problem; the algorithm's complexity is quadratic in k. We also present two heuristics with complexity linear in k. In an experimental study we show that these heuristics are much faster than the exact algorithm also in practice, and that their solutions are around 1% of optimal for small values of k and much better for large k.
منابع مشابه
Spanning tree congestion critical graphs
The linear or cyclic cutwidth of a graph G is the minimum congestion when G is embedded into either a path or a cycle respectively. A graph is cutwith critical if it is homeomorphically minimal and all of its subgraphs have lower cutwitdth. Our purpose is to extend the study of congestion critical graphs to embeddings on spanning trees.
متن کاملMinimum congestion spanning trees of grids and discrete toruses
The paper is devoted to estimates of the spanning tree congestion for grid graphs and discrete toruses of dimensions two and three.
متن کاملMinimum congestion spanning trees in planar graphs
The main purpose of the paper is to develop an approach to evaluation or estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate the spanning tree congestion of triangular grids.
متن کاملMinimum congestion spanning trees in bipartite and random graphs
The first problem considered in this paper: is it possible to find upper estimates for the spanning tree congestion for bipartite graphs which are better than for general graphs? It is proved that there exists a bipartite version of the known graph with spanning tree congestion of order n 3 2 , where n is the number of vertices. The second problem is to estimate spanning tree congestion of rand...
متن کاملSpanning tree congestion of rook's graphs
Let G be a connected graph and T be a spanning tree of G. For e ∈ E(T ), the congestion of e is the number of edges in G joining the two components of T − e. The congestion of T is the maximum congestion over all edges in T . The spanning tree congestion of G is the minimum congestion over all its spanning trees. In this paper, we determine the spanning tree congestion of the rook’s graph Km Kn...
متن کامل